منابع مشابه
Minimum-Width Confidence Bands via Constraint Optimization
The use of constraint optimization has recently proven to be a successful approach to providing solutions to various NP-hard search and optimization problems in data analysis. In this work we extend the use of constraint optimization systems further within data analysis to a central problem arising from the analysis of multivariate data, namely, determining minimum-width multivariate confidence...
متن کاملConstraint Optimization Problems and Bounded Tree-Width Revisited
The valued constraint satisfaction problem (VCSP) is an optimization framework originating from artificial intelligence which generalizes the classical constraint satisfaction problem (CSP). In this paper, we are interested in structural properties that can make problems from the VCSP framework, as well as other CSP variants, solvable tooptimality in polynomial time. So far, the largest structu...
متن کاملProduction Optimization under Uncertainty with Constraint Handling
To maximize the daily production from an oil and gas field, mathematical optimization may be used to find the optimal operating point. When optimizing, a model of the system is used to predict the outcome for different operating points. The model is, however, subject to uncertainty, e.g., the gas oil ratio estimates may be imprecise. The uncertainty is often ignored, and what is known as the ex...
متن کاملDistributed Constraint Optimization Under Stochastic Uncertainty
In many real-life optimization problems involving multiple agents, the rewards are not necessarily known exactly in advance, but rather depend on sources of exogenous uncertainty. For instance, delivery companies might have to coordinate to choose who should serve which foreseen customer, under uncertainty in the locations of the customers. The framework of Distributed Constraint Optimization u...
متن کاملConjunctive Width al Constraint Satisfaction
A constraint satisfaction problem may not admit a complete solution; in this case a good partial solution may be acceptable. This paper presents new techniques for organizing search with branch and bound algorithms so that maximal partial solutions (those having the maximum possible number of satisfied constraints) can be obtained in reasonable time for moderately sized problems. The key featur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2012
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-012-9471-z